Nuprl Lemma : weak-precond-send-realizable 11,40

T:Type, p:FinProbSpace, l:IdLnk, ds:x:Id fp Type, P:(State(ds)), f:(State(ds)OutcomeT).
Normal(T Normal(ds es.weak-precond-send-p(es;T;Outcome;l;"tg";"a";ds;P;f
latex


DefinitionsSQType(T), {T}, e c e', x:AB(x), P  Q, e@iP(e), Knd, weak-precond-send-p(es;T;A;l;tg;a;ds;P;f), A c B, sframe-p-realizable, usends1-p-realizable, Normal(T), Rplus-right(x1), Rplus-left(x1), if b then t else f fi , tt, ff, Rplus?(x1), b, True, Y, reduce(f;k;as), (L), pre-p-realizable, es-realizer(p), t.2, t.1, P & Q, at src(l):action $a(m) precondition P sends [$tg,f] on link l, suptype(ST), S  T, xt(x), , t  T, "$x", P  Q, Id, x:AB(x), Trans(T;x,y.E(x;y)), Dec(P), e'e.P(e'), P  Q, only events in L send on l with tg, usends1-p(es;ds;k;T;l;tg;B;f), @i Precondition for a:Outcome(p) is P:State(ds) , Unit, False, R ||- es.P(es), es.P(es), Realizer, x(s), Rrframe(loc;x;L), Rbframe(loc;k;L), Raframe(loc;k;L), Reffect(loc;ds;knd;T;x;f), Rframe(loc;T;x;L), Rinit(loc;T;x;v), , Rnone(), left  right, Rsframe(lnk;tag;L), Rsends(ds;knd;T;l;dt;g), Rpre(loc;ds;a;p;P), x  {FDLNOr12445}
Lemmases-le weakening eq, es-le transitivity, es-causle weakening, es-sender-causl, es-causle-trans, es-causle wf, es-loc wf, es-causl wf, es-le-loc, Id sq, es-vartype wf, es-state-subtype, es-state-after-elapsed wf, not wf, decidable es-le, decidable equal Kind, es-le wf, decidable cand, es-causle weakening locl, es-val wf, es-E wf, rcv wf, es-kind-rcv, es-sender wf, es-kind wf, member singleton, sframe-p wf, R-sub-plus-right3, locl wf, usends1-p wf, tagof wf, lnk wf, ldst wf, isrcv wf, natural number wf p-outcome, R-sub-plus-left, decl-type wf, Knd wf, rationals wf, unit wf, es realizer wf, false wf, true wf, R-sub-implies, lsrc wf, pre-p wf, es-real wf, finite-prob-space wf, IdLnk wf, Id wf, fpf wf, bool wf, decl-state wf, normal-type wf, normal-ds wf, R-consistent wf, event system wf, assert wf, p-outcome wf, weak-precond-send-p wf, implies-es-real, weakPrecondSendR feasible, weakPrecondSendR wf

origin